On the estimation of buffer overflow probabilities from measurements
نویسندگان
چکیده
We propose estimators of the buffer overflow probability in queues fed by a Markov-modulated input process and serviced by an autocorrelated service process. These estimators are based on large-deviations asymptotics for the overflow probability. We demonstrate that the proposed estimators are less likely to underestimate the overflow probability than the estimator obtained by certainty equivalence. As such, they are appropriate in situations where the overflow probability is associated with quality of service (QoS) and we need to provide firm QoS guarantees. We also show that as the number of observations increases to infinity the proposed estimators converge with probability one to the appropriate target, and thus, do not lead to underutilization of the system in this limit.
منابع مشابه
Estimation of Buffer Overflow Probabilities and Economies of Scale in ATM Multiplexers by Analysis of a Model of Packetized Voice Traffic
Estimation of Buffer Overflow Probabilities and Economies of Scale in ATM M ultiplexers by Analysis of a M odel of Packetized Voice Traffic by Paul J. Farrell We obtain upper bounds on the probability of buffer overflow for an ATM multiplexer of L identical packetized voice sources The multiplexer is modelled by a FCFS single server queue The arrivals at the multiplexer are a homogenous superpo...
متن کاملEstimating Tail Probabilities in Queues via Extremal Statistics
We study the estimation of tail probabilities in a queue via a semi-parametric estimator based on the maximum value of the workload, observed over the sampled time interval. Logarithmic consistency and efficiency issues for such estimators are considered, and their performance is contrasted with the (non-parametric) empirical tail estimator. Our results indicate that in order to “successfully” ...
متن کاملStudy on Estimating Buffer Overflow Probabilities in High-Speed Communication Networks
The paper recommends new methods to estimate effectively the probabilities of buffer overflow in high-speed communication networks. The frequency of buffer overflow in queuing system is very small; therefore the overflow is defined as rare event and can be estimated using rare event simulation with continuous-time Markov chains. First, a two-node queuing system is considered and the buffer over...
متن کاملEstimating Buffer Overflows in Three Stages Using Cross-entropy
In this paper we propose a fast adaptive Importance Sampling method for the efficient simulation of buffer overffow probabilities in queueing networks. The method comprises three stages. First we estimate the minimum Cross-Entropy tilting parameter for a small buffer level; next, we use this as a starting value for the estimation of the optimal tilting parameter for the actual (large) buffer le...
متن کاملState-Dependent Importance Sampling Simulation of Markovian Queueing Networks
In this paper, a method is presentedfor the efficient estimation of rarecvent (buffer overflow) probabilities in queueing networks using importance sampling. Unlike previously proposed change of measures, the one used here is not static, i.e., it depends on the buffer contenrs at each of the network nodes. The ‘optimal’ statedependent change of measure is determined adaptively during the simuln...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 47 شماره
صفحات -
تاریخ انتشار 2001